Problem solving of container loading using genetic algorithm based on modified random keys

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Tree Search Algorithm for Solving the Container Loading Problem

The paper presents a tree search algorithm for the three-dimensional container loading problem (3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangular boxes into a rectangular container so that the packed volume is maximized. The method has two variants: the packing variant guarantees full support from below for all packed boxes, while this constraint is not taken ...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

Solving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm

One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA).  Simula...

متن کامل

A Genetic Algorithm for Solving a Container Storage Problem Using a Residence Time Strategy

At each port of destination, some containers are unloaded from a vessel and stored in the terminal to be delivered to their customers. One of the strategies used to arrange the containers in a terminal is residence time strategy: based on their delivery deadlines, each incoming container being assigned to a priority class. The aim of this study is to determine a valid arrangement of incoming co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Advanced Computer Science & Technology

سال: 2015

ISSN: 2227-4332

DOI: 10.14419/jacst.v4i1.4348